Summer 2017: Nserc Usra Report Computing Shape Dna Using the Closest Point Method
نویسنده
چکیده
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملAdaptive MCMC: Background, Theory, and Simulations
This research report was written during the summer of 2006 under Professor Jeffrey Rosenthal with the support of NSERC USRA. There are two major purposes to this research report. The first is to summarize the theoretical foundations of adaptive MCMC, including necessary backgrounds in measure theory, general state-space Markov chains, and non-adaptive MCMC so that a strong undergraduate math st...
متن کاملShape-aware surface reconstruction from sparse 3D point-clouds
The reconstruction of an object's shape or surface from a set of 3D points plays an important role in medical image analysis, e.g. in anatomy reconstruction from tomographic measurements or in the process of aligning intra-operative navigation and preoperative planning data. In such scenarios, one usually has to deal with sparse data, which significantly aggravates the problem of reconstruction...
متن کاملPoint-Based Statistical Shape Models with Probabilistic Correspondences and Affine EM-ICP
A fundamental problem when computing statistical shape models (SSMs) is the determination of correspondences between the instances. Often, homologies between points that represent the surfaces are assumed which might lead to imprecise mean shape and variation results. We present a novel algorithm based on the affine Expectation Maximization Iterative Closest Point (EM-ICP) registration method. ...
متن کاملNSERC USRA Report Smooth Particle Hydrodynamics
This formulation requires well defined boundary conditions; and solvers to those systems are, so far, computationally expensive. The existing SPH-algorithm solves the dynamic in a Projection-Correction Scheme extrapolate the ˆ uk+1, the velocity-projection, without pressure term and later correct it via solving the p as an explicit function of density. Moreover, since field variables is approxi...
متن کامل